A New Algorithm for Computing Certified Numerical Approximations of the Roots of a Zero-dimensional System Stef Graillat, Philippe Trébuchet LIP6 - Université Pierre et Marie Curie (Paris 6)

Source URL: issac2009.kias.re.kr

• Matrix theory
• Linear algebra
• Abstract algebra
• Numerical linear algebra
• Eigenvalues and eigenvectors
• Singular value decomposition
• Canonical basis
• Matrix
• Schur decomposition
• Polynomial
• Eigenvalue algorithm

Distributed Computing manuscript No. (will be inserted by the editor) Distributed Minimum Dominating Set Approximations in Restricted Families of Graphs Christoph Lenzen · Yvonne-Anne Pignolet · Roger Wattenhofer

Source URL: people.mpi-inf.mpg.de

• NP-complete problems
• Maximal independent set
• Treewidth
• Arboricity
• Dominating set
• Planar graph
• Independent set
• Matching
• Graph minor
• Bipartite graph
• Line graph
• Planar separator theorem

IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 61, NO. 12, JUNE 15, Efficient Methods to Compute Optimal Tree Approximations of Directed Information Graphs

Source URL: coleman.ucsd.edu

• Statistical models
• Spanning tree
• Networks
• Graphical models
• Bayesian network
• Minimum spanning tree
• Line graph
• Algorithm
• Directed acyclic graph
• Pi
• Feedback arc set
• Book:Graph Theory

JOURNAL OF GEOPHYSICAL RESEARCH, VOL. 111, D01302, doi:2005JD006149, 2006 Uncertainty in a chemistry-transport model due to physical parameterizations and numerical approximations: An ensemble approach applied t

Source URL: cerea.enpc.fr

• Operations research
• Computational science
• Simulation
• Climate modeling
• Monte Carlo method
• Accuracy and precision
• Atmospheric chemistry

Mathemati al Analysis of Born{Oppenheimer Approximations George A. Hagedorn and Alain Joye Dedi ated to Barry Simon in elebration of his 60th birthday. Abstra t. We review mathemati al results on erning Born{Oppenheime

Source URL: www.math.vt.edu

• California Institute of Technology faculty
• J. Robert Oppenheimer
• McCarthyism
• Spectroscopy

Secure Multiparty Computation of Approximations∗ Joan Feigenbaum† Yuval Ishai‡ Martin J. Straussk

Source URL: www.cs.yale.edu

• Quantum complexity theory
• Computational complexity theory
• Cryptography
• Functions and mappings
• Secure multi-party computation
• Secure two-party computation
• Communication complexity
• Limit of a function
• Pi
• Cryptographic protocol
• PP
• Approximation algorithm

RAD-16-NS1 THE BREAKDOWN OF EFFECTIVE MEDIUM THEORY IN MULTILAYERED HYPERBOLIC MATERIALS Richard Z. Zhang and Zhuomin M. Zhang* George W. Woodruff School of Mechanical Engineering, Georgia Institute of Technology, Atlant

Source URL: abstract.ichmt.org

• Physics
• Optics
• Metamaterials
• Nature
• Electromagnetism
• Nanomaterials
• Science
• Superlens
• Effective medium approximations
• Refraction
• Negative refraction
• Wavelength

Padé approximations for Painlevé I and II transcendents Victor Novokshenov Institute of Mathematics Ufa Scientific Center Russian Academy of Sciences

Source URL: zakharov70.itp.ac.ru

Statistica Sinica), GAUSSIAN APPROXIMATIONS FOR NON-STATIONARY MULTIPLE TIME SERIES Wei Biao Wu and Zhou Zhou University of Chicago and University of Toronto

Source URL: www.utstat.toronto.edu

Clamping Improves TRW and Mean Field Approximations APPENDIX: SUPPLEMENTARY MATERIAL Clamping Improves TRW and Mean Field Approximations In this Appendix, we provide: • Details of all methods used for selecting a vari

Source URL: jmlr.org